Linear Systems for Regular Hedge Languages
نویسندگان
چکیده
We propose linear systems of hedge language equations (LSH) as a formalism to represent regular hedge languages. These linear systems are suitable for several computations in the algebra of regular hedge languages. We indicate algorithms to translate between representations by hedge automata and LSH, and for the computation of LSH for the intersection, quotient, left and right factors of regular hedge languages.
منابع مشابه
Computational Methods in an Algebra of Regular Hedge Expressions
We propose an algebra of regular hedge expressions built on top of regular hedge grammars as a framework for the analysis and manipulation of hedge languages. We show how linear systems of hedge language equations (LS for short) can be used as an intermediate representation on which to perform the computation of quotient, intersection, product derivative, and factor matrix of regular hedge lang...
متن کاملRegular Hedge Language Factorization Revisited
We consider the factorization problem of regular hedge languages. This problem is strongly related to the type checking problem in rule based transformations of valid XML documents. We propose the representation of regular hedge languages by reduced, complete, and deterministic linear hedge automata, and indicate algorithms for the computation of right factors and factor matrix.
متن کاملClosure of Hedge-automata Languages by Hedge Rewriting Closure of Hedge-automata Languages by Hedge Rewriting
We consider rewriting systems for unranked ordered terms, i.e. trees where the number of successors of a node is not determined by its label, and is not a priori bounded. The rewriting systems are defined such that variables in the rewrite rules can be substituted by hedges (sequences of terms) instead of just terms. Consequently, this notion of rewriting subsumes both standard term rewriting a...
متن کاملRewrite Closure of Hedge-automata Languages
We investigate some preservation properties for classes of regular languages of unranked ordered terms under an appropriate generalization of term rewriting subsuming both standard term rewriting and word rewriting. The considered classes include languages of hedge automata (HA) and some extension (called CF-HA) with context-free languages in transitions, instead of regular languages. In partic...
متن کاملClosure of Hedge-Automata Languages by Hedge Rewriting
We consider rewriting systems for unranked ordered terms, i.e. trees where the number of successors of a node is not determined by its label, and is not a priori bounded. The rewriting systems are defined such that variables in the rewrite rules can be substituted by hedges (sequences of terms) instead of just terms. Consequently, this notion of rewriting subsumes both standard term rewriting a...
متن کامل